Crossing probabilities for planar percolation
نویسندگان
چکیده
We prove a general Russo–Seymour–Welsh (RSW) result valid for any invariant bond percolation measure on Z2 satisfying positive association. This means that the crossing probability of long rectangle is related by universal homeomorphism to short rectangle.
منابع مشابه
Universal crossing probabilities and incipient spanning clusters in directed percolation
Shape-dependent universal crossing probabilities are studied, via Monte Carlo simulations, for bond and site directed percolation on the square lattice in the diagonal direction, at the percolation threshold. In a dynamical interpretation, the crossing probability is the probability that, on a system with size L, an epidemic spreading without immunization remains active at time t. Since the sys...
متن کاملFate of 2D kinetic ferromagnets and critical percolation crossing probabilities.
We present evidence for a deep connection between the zero-temperature coarsening of both the two-dimensional time-dependent Ginzburg-Landau equation and the kinetic Ising model with critical continuum percolation. In addition to reaching the ground state, the time-dependent Ginzburg-Landau equation and kinetic Ising model can fall into a variety of topologically distinct metastable stripe stat...
متن کاملCrossing Probabilities in Critical 2-D Percolation and Modular Forms
Crossing probabilities for critical 2-D percolation on large but finite lattices have been derived via boundary conformal field theory. These predictions agree very well with numerical results. However, their derivation is heuristic and there is evidence of additional symmetries in the problem. This contribution gives a preliminary examination some unusual modular behavior of these quantities. ...
متن کاملOn the universality of crossing probabilities in two-dimensional percolation†
The geometrical explanation of universality in terms of fixed points of renormalization-group transformations has met with enormous success, but its lack of precision continues to present a challenge to the mathematician, even for relatively simple models, such as percolation in two dimensions. To begin to reflect on the problem, one can assume that the crossing probabilities (cf. [5]) at the c...
متن کاملvertex centered crossing number for maximal planar graph
the crossing number of a graph is the minimum number of edge crossings over all possible drawings of in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 2023
ISSN: ['1547-7398', '0012-7094']
DOI: https://doi.org/10.1215/00127094-2022-0015